Network constraints on learnability of probabilistic motor sequences
نویسندگان
چکیده
منابع مشابه
Network constraints on learnability of probabilistic motor sequences
Human learners are adept at grasping the complex relationships underlying incoming sequential input. In the present work, we formalize complex relationships as graph structures derived from temporal associations in motor sequences. Next, we explore the extent to which learners are sensitive to key variations in the topological properties inherent to those graph structures. Participants performe...
متن کاملOn learnability and naturalness as constraints on phonological grammar
We report six experiments on learnability of four non-adjacent phonotactic constraints which differ in their attested frequency and phonetic conditioning factors; liquid harmony, liquid disharmony, backness harmony, and backness disharmony. Our results suggest that such phonotactic constraints can be implicitly learned from brief experience and that learnability of a phonological grammar may be...
متن کاملLearnability of Probabilistic Automata via Oracles
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed μ-distinguishable. In this paper, we prove that state merging algorithms can be extended to efficiently learn a larger class of automata. In particular, we show learnability of a subclass which we call μ2-distinguishable. Using an analog of the Myhill-Nerode theorem for probabilisti...
متن کاملLexically Specific Constraints: Gradience, Learnability, and Perception
Lexically specific constraints are indexed versions of constraints that apply only when a morpheme that bears that index is evaluated by the grammar. They have been used in Optimality Theory to deal with exceptions (e.g. Hammond 1995, Kraska-Szlenk 1997, Pater 2000), and have also been applied to the lexical strata of Japanese and other languages (Fukuzawa 1999, Itô and Mester 1999, 2001, Gelba...
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Human Behaviour
سال: 2018
ISSN: 2397-3374
DOI: 10.1038/s41562-018-0463-8